Post-Quantum Cryptosystem NTRUEnCrypt and Its Advantage over Pre – Quantum Cryptosystem RSA
نویسندگان
چکیده
منابع مشابه
Attack on RSA Cryptosystem
The RSA cryptosystem is most widely used cryptosystem it may be used to provide both secrecy and digital signatures and its security is based on the intractability of the integer factorization. The security of RSA algorithm depends on the ability of the hacker to factorize numbers. New, faster and better methods for factoring numbers are constantly being devised. The Trent best for long numbers...
متن کاملImprovement in RSA Cryptosystem
Boneh and Shacham gave a nice survey on four variants (Batch RSA, MultiPrime RSA, MultiPower RSA, Rebalanced RSA). Rebalanced RSA and MultiPower RSA were then combined to increase the decryption/signature generation performance. This combination theoretically improves the decryption/signature generation time about 14 times than RSA with CRT and about 56 times than the standard RSA with key size...
متن کاملQuantum McEliece public-key cryptosystem
The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantumMcEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the clas...
متن کاملThe RSA Cryptosystem
This paper explores the history and mathematics be hind the RSA cryptosystem, including the idea of public key cryp tosystems and number theory. It outlines the applications of RSA including secure information transfers and electronic signatures. It also analyzes why RSA is a secure way of transmitting information and the ways that it has been defeated in the past. In particular, we focus on ...
متن کاملA Practical Post-Quantum Public-Key Cryptosystem Based on spLWE
The Learning with Errors (LWE) problem has been widely used as a hardness assumption to construct public-key primitives. In this paper, we propose an efficient instantiation of a PKE scheme based on LWE with a sparse secret, named as spLWE. We first construct an IND-CPA PKE and convert it to an IND-CCA scheme in the quantum random oracle model by applying a modified Fujisaki-Okamoto conversion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S Web of Conferences
سال: 2020
ISSN: 2267-1242
DOI: 10.1051/e3sconf/202022401037